-
1 graph vertices
Макаров: вершины графов -
2 graph node
т. граф. точка [вершина\] графа (элемент графа, обозначающий объект любой природы, входящий в множество объектов, описываемое графом)Syn:See: -
3 graph on n vertices
Математика: n-вершинный граф -
4 vertices x and y of a graph G are similar if there is an automorphism of G which takes x to y
Универсальный англо-русский словарь > vertices x and y of a graph G are similar if there is an automorphism of G which takes x to y
-
5 adjacent vertices
т. граф. смежные вершины (две вершины называются смежными, если существует соединяющее их ребро (в графе) или соединяющая их дуга (в орграфе))Syn:joined vertices, adjacent nodesSee: -
6 Wiener index is a topological index defined as sum of distances between all pairs of vertices in a chemical graph
Общая лексика: (graph invariant) индекс Винера - это топологический индекс или инвариант графа, определяемый как сумма расстояний между всеми парами вУниверсальный англо-русский словарь > Wiener index is a topological index defined as sum of distances between all pairs of vertices in a chemical graph
-
7 the Wiener index is a topological index defined as the sum of distances between all pairs of vertices in a chemical graph
Общая лексика: (graph invariant) индекс Винера - это топологический индекс или инвариант графа, определяемый как сумма расстояний между всемиУниверсальный англо-русский словарь > the Wiener index is a topological index defined as the sum of distances between all pairs of vertices in a chemical graph
-
8 Wiener index is a topological index (graph invariant) defined as sum of distances between all pairs of vertices in a chemical graph
Общая лексика: индекс Винера - это топологический индекс или инвариант графа, определяемый как сумма расстояний между всеми парами вУниверсальный англо-русский словарь > Wiener index is a topological index (graph invariant) defined as sum of distances between all pairs of vertices in a chemical graph
-
9 the Wiener index is a topological index (graph invariant) defined as the sum of distances between all pairs of vertices in a chemical graph
Общая лексика: индекс Винера - это топологический индекс или инвариант графа, определяемый как сумма расстояний между всемиУниверсальный англо-русский словарь > the Wiener index is a topological index (graph invariant) defined as the sum of distances between all pairs of vertices in a chemical graph
-
10 k k-regular graph on n vertices
Математика: регулярный граф степениУниверсальный англо-русский словарь > k k-regular graph on n vertices
-
11 vertex
pl vertices nounвершина fvertex degree степень f вершиныАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > vertex
См. также в других словарях:
Graph pebbling — is a mathematical game and area of interest played on a graph with pebbles on the vertices. Game play is composed of a series of pebbling moves. A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an… … Wikipedia
Graph — may refer to:* A graphic (such as a chart or diagram) depicting the relationship between two or more variables used, for instance, in visualising scientific data.In mathematics:* Graph (mathematics), a set of vertices connected with edges * Graph … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph labeling — In the mathematical discipline of graph theory, a graph labeling is the assignment of labels traditionally represented with integers to the edges or vertices, or both, of a graph. The labeling strategy depends on the category of the labeling.… … Wikipedia
Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… … Wikipedia
Graph homomorphism — Not to be confused with graph homeomorphism. In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps adjacent vertices to adjacent vertices. Contents 1… … Wikipedia